LOGSPACE and PTIME characterized by programming languages
نویسندگان
چکیده
منابع مشابه
Logspace and Logtime Leaf Languages
The computation tree of a nondeterministic machine M with input x gives rise to a leaf string formed by concatenating the outcomes of all the computations in the tree in lexicographical order. We may characterize problems by considering, for a particular \leaf language" Y , the set of all x for which the leaf string of M is contained in Y . In this way, in the context of polynomial time computa...
متن کاملSeparability by piecewise testable languages is PTime-complete
Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regula...
متن کاملMemoization for Unary Logic Programming: Characterizing PTIME
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms. More precisely, we study the restriction of this framework to terms (and logic programs, rewriting rules) using only unary symbols. We prove it is complete for...
متن کاملPola: A Language for PTIME Programming
Pola is a functional style programming language—currently under development—whose type system guarantees that all its programs run in polynomial time. Indeed, as every polynomial time (PTIME) algorithm can be rendered in Pola, the language is complete for polynomial time programming. Furthermore, to someone familiar with functional programming, Pola enforces a style of programming which is—rela...
متن کاملDelta-Languages for Sets and LOGSPACE Computable Graph Transformers
We discuss several versions of a set theoretic-language as a reasonable prototype for \nested" data base query language where data base states and queries are considered, respectively, as hereditarily-nite sets and set theoretic operations. In a previous work such a language exactly corresponding to PTIME-computability was introduced. It is supposed that HF-sets are naturally presented by verti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00357-0